package base.mathlogic;

import java.util.Stack;

public class Stack2Queque {

	 	Stack<Integer> stack1 = new Stack<Integer>();
	    Stack<Integer> stack2 = new Stack<Integer>();
	    
	    public void push(int node){
	        stack1.push(node);
	    }
	    
	    public int pop(){
	        if(stack2.empty()){
	            while(!stack1.empty())
	                stack2.push(stack1.pop());//倒腾成顺序队列
	        }
	        return stack2.pop();
	    }
	
}
